A Group-theory Method to The Cycle Structures of Feedback Shift Registers
نویسندگان
چکیده
In this paper, we consider the cycle structures of feedback shift registers (FSRs). At the beginning, the cycle structures of two special classes of FSRs, pure circulating registers (PCRs) and pure summing registers (PSRs), are studied and it is proved that there are no other FSRs have the same cycle structure of an PCR (or PSR). Then, we regard n-stage FSRs as permutations over 2n elements. According to the group theory, two permutations have the same cycle structure if and only if they are conjugate with each other. Since a conjugate of an FSR may no longer an FSR, it is interesting to consider the permutations that always transfer an FSR to an FSR. It is proved that there are exactly two such permutations, the identity mapping and the mapping that map every state to its dual. Furthermore, we prove that they are just the two permutations that transfer any maximum length FSR to an maximum length FSR.
منابع مشابه
On Binary de Bruijn Sequences from LFSRs with Arbitrary Characteristic Polynomials
We propose a construction of de Bruijn sequences by the cycle joining method from linear feedback shift registers (LFSRs) with arbitrary characteristic polynomial f(x). We study in detail the cycle structure of the set Ω(f(x)) that contains all sequences produced by a specific LFSR on distinct inputs and provide an efficient way to find a state of each cycle. Our structural results lead to an e...
متن کاملSearching for Nonlinear Feedback Shift Registers with Parallel Computing
Nonlinear feedback shift registers (NLFSRs) are used to construct pseudorandom generators for stream ciphers. Their theory is not so complete as that of linear feedback shift registers (LFSRs). In general, it is not known how to construct all NLFSRs with maximum period. The direct method is to search for such registers with suitable properties. Advanced technology of parallel computing has been...
متن کاملOn the linear complexity of feedback registers
In this paper, we study sequences generated by arbitrary feedback registers (not necessarily feedback shift registers) with arbitrary feedforward functions. We generalize the definition of linear complexity of a sequence to the notions of strong and weak linear complexity of feedback registers. A technique for finding upper bounds for the strong linear complexities of such registers is develope...
متن کاملFibonacci and Galois representations of feedback-with-carry shift registers
Feedback with carry shift registers (FCSRs) are a class of finite state devices that are similar to linear feedback shift registers (LFSRs) in their simplicity and statistical randomness, and in that they have algebraic tools for the analysis of their output. In this paper we describe and analyze an alternative architecture for FCSRs that is similar to the Galois architecture for LFSRs. We also...
متن کاملACHTERBAHN: A Proposal for a Profile 2 Stream Cipher to ECRYPT’s Call for Stream Cipher Primitives
We propose a new additive binary stream cipher called Achterbahn. The keystream generator (KSG) consists of eight primitive binary nonlinear feedback shift registers (NLFSR’s). A binary N -stage feedback shift register is called primitive if it has a cycle of length 2N − 1 containing all binary nonzero N tuples. Each shift register has a configurable linear feedforward output function. The outp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015